A Construction for Secret Sharing Scheme with General Access Structure
نویسندگان
چکیده
Many efficient secret sharing schemes for general access structures have been developed in efforts to deal with the problems of multi-party computations (MPC), threshold cryptography, and access control. In this paper, we have proposed a novel secret sharing scheme with general access structures that is based on the key-lock-pair mechanism. In our scheme, the dealer can assess a real situation and design the corresponding access structures, Γ = (Γ1,Γ2, . . . ,Γm). The different qualified subset of participants in Γ = (Γ1,Γ2, . . . ,Γm) can cooperate to reconstruct the shared secret, and no unqualified participants can reconstruct the corresponding shared secret.
منابع مشابه
A Fast Publicly Verifiable Secret Sharing Scheme using Non-homogeneous Linear Recursions
A non-interactive (t,n)-publicly veriable secret sharing scheme (non-interactive (t,n)-PVSS scheme) is a (t,n)-secret sharing scheme in which anyone, not only the participants of the scheme, can verify the correctness of the produced shares without interacting with the dealer and participants. The (t,n)-PVSS schemes have found a lot of applications in cryptography because they are suitable for<...
متن کاملAn Analytic Construction of the Visual Secret Sharing Scheme for Color Images∗
This paper proposes a new construction of the visual secret sharing scheme for the (n, n)-threshold access structure applicable to color images. The construction uses matrices with n rows that can be identified with homogeneous polynomials of degree n. It is shown that, if we find a set of homogeneous polynomials of degree n satisfying a certain system of simultaneous partial differential equat...
متن کاملEfficient Construction of Visual Cryptographic Scheme for Compartmented Access Structures
In this paper, we consider a special type of secret sharing scheme known as Visual Cryptographic Scheme (VCS) in which the secret reconstruction is done visually without any mathematical computation unlike other secret sharing schemes. We put forward an efficient direct construction of a visual cryptographic scheme for compartmented access structure which generalizes the access structure for th...
متن کاملVisual Secret Sharing Schemes with Cyclic Access Structure for Many Images
We consider a visual secret sharing scheme with cyclic access structure for n secret images and n shares, where two consecutive shares decode one secret image. This secret sharing scheme can be constructed by using Droste’s method. However the contrast of its scheme is 1/(2n). In this paper, it is shown that for every integer n ≥ 4, there exists no construction of such a visual secret sharing s...
متن کاملWeakly-Private Secret Sharing Schemes
Secret-sharing schemes are an important tool in cryptography that is used in the construction of many secure protocols. However, the shares’ size in the best known secret-sharing schemes realizing general access structures is exponential in the number of parties in the access structure, making them impractical. On the other hand, the best lower bound known for sharing of an `-bit secret with re...
متن کامل